- Notifications
You must be signed in to change notification settings - Fork 31
/
Copy path118. Pascal's Triangle.c
56 lines (46 loc) · 1.17 KB
/
118. Pascal's Triangle.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
118. Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
*/
/**
* Return an array of arrays.
* The sizes of the arrays are returned as *columnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
int**generate(intnumRows, int**columnSizes) {
inti, j;
int*buff, **p;
p=malloc(numRows*sizeof(int*));
*columnSizes=malloc(numRows*sizeof(int));
//assert(p && *columnSizes);
for (i=1; i <= numRows; i++) {
buff=malloc(i*sizeof(int));
//assert(buff);
p[i-1] =buff;
(*columnSizes)[i-1] =i;
buff[0] =1;
for (j=1; j<i-1; j++) {
buff[j] =p[i-2][j-1] +p[i-2][j];
}
buff[i-1] =1;
}
returnp;
}
/*
Difficulty:Easy
Total Accepted:137.9K
Total Submissions:357.7K
Companies Apple Twitter
Related Topics Array
Similar Questions
Pascal's Triangle II
*/